Type-based termination of generic programs
نویسندگان
چکیده
منابع مشابه
Type-based termination of generic programs
Instances of a polytypic or generic program for a concrete recursive type often exhibit a recursion scheme that is derived from the recursion scheme of the instantiation type. In practice, the programs obtained from a generic program are usually terminating, but the proof of termination cannot be carried out with traditional methods as term orderings alone, since termination often crucially rel...
متن کاملGeneric proofs for combinator-based generic programs
Generic programming can bring important benefits to software engineering. In particular, it reduces the burden of verification, since generic proofs can be instantiated at many types. Reasoning about programs that use type classes does not enjoy the benefits of generic reasoning, as it requires providing proofs for an arbitrary number of type instances. This makes the process very impractical. ...
متن کاملTermination of Linear Programs
We show that termination of a class of linear loop programs is decidable. Linear loop programs are discrete-time linear systems with a loop condition governing termination, that is, a while loop with linear assignments. We relate the termination of such a simple loop, on all initial values, to the eigenvectors corresponding to only the positive real eigenvalues of the matrix defining the loop a...
متن کاملTermination Of Linear Programs
Many real-time applications have linear programs, which can get a variety of inputs in different situations. It is possible that some of these are “bad” inputs which cause unexpected failures like non-termination of the program. Such instances can lead to disastrous consequences and the programs must be verified to ensure that they either terminate or the inputs under which they don’t terminate...
متن کاملTermination of Monotone Programs
We present an efficient approach to prove termination of monotone programs with integer variables, an expressive class of loops that is often encountered in computer programs. Our approach is based on a lightweight static analysis method and takes advantage of simple properties of monotone functions. Our preliminary implementation shows that our tool has an advantage over existing tools and can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2009
ISSN: 0167-6423
DOI: 10.1016/j.scico.2008.01.004